A dynamic programming solution to automate fabrication sequencing of industrial construction components
نویسندگان
چکیده
a Hole School of Construction Engineering andManagement, Department of Civil and Environmental Engineering, University of Alberta, 1–047Markin/CNRLNatural Resources Engineering Facility, Edmonton, Alberta T6G 2W2, Canada b Hole School of Construction Engineering andManagement, Department of Civil and Environmental Engineering, University of Alberta, 3–011Markin/CNRLNatural Resources Engineering Facility, Edmonton, Alberta T6G 2W2, Canada
منابع مشابه
Automating fabrication sequencing for industrial construction
Purpose Industrial construction projects are heavily dependent on pre-fabrication of piping components. Unlike traditional manufacturing, many pipe spools have a unique design and need to be custom fabricated due to the one-of-a-kind characteristic of each industrial project. This is reflected in the fact that fabrication sequences vary greatly among pipe spools. Planning these sequences has co...
متن کاملA dynamic bi-objective model for after disaster blood supply chain network design; a robust possibilistic programming approach
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
متن کاملSolving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملUsing Hybrid Fuzzy PROMETHEE II and Fuzzy Binary Goal Programming for Risk Ranking: A Case Study of Highway Construction Projects
Multi attribute decision making methods are considered as one of the most useful methods for solving ranking problems. In some decision making problems, while the alternatives for corresponding criteria are compared in a pairwise comparison manner, if the criteria are inherently fuzzy, debates will arise in ranking alternatives due to the closeness of the values of the criteria. In this researc...
متن کامل